Non - commutative finite monoids of a given order n ≥ 4
نویسنده
چکیده
For a given integer n = p1 1 p α2 2 . . . p αk k , (k ≥ 2), we give here a class of finitely presented finite monoids of order n. Indeed the monoids Mon(π), where π = 〈a1, a2, . . . , ak|a p αi i i = ai, (i = 1, 2, . . . , k), aiai+1 = ai, (i = 1, 2, . . . , k − 1)〉. As a result of this study we are able to classify a wide family of the kgenerated p-monoids (finite monoids of order a power of a prime p). An interesting difference between the center of finite p-groups and the center of finite p-monoids has been achieved as well. All of these monoids are regular and non-commutative.
منابع مشابه
On the Finite Embeddability Property for Residuated Ordered Groupoids
The finite embeddability property (FEP) for integral, commutative residuated ordered monoids was established by W. J. Blok and C. J. van Alten in 2002. Using Higman’s finite basis theorem for divisibility orders we prove that the assumptions of commutativity and associativity are not required: the classes of integral residuated ordered monoids and integral residuated ordered groupoids have the ...
متن کاملOn the Zero-divisor Cayley Graph of a Finite Commutative Ring
Let R be a fnite commutative ring and N(R) be the set of non unit elements of R. The non unit graph of R, denoted by Gamma(R), is the graph obtained by setting all the elements of N(R) to be the vertices and defning distinct vertices x and y to be adjacent if and only if x - yin N(R). In this paper, the basic properties of Gamma(R) are investigated and some characterization results regarding co...
متن کاملOn the Szeged and Eccentric connectivity indices of non-commutative graph of finite groups
Let $G$ be a non-abelian group. The non-commuting graph $Gamma_G$ of $G$ is defined as the graph whose vertex set is the non-central elements of $G$ and two vertices are joined if and only if they do not commute.In this paper we study some properties of $Gamma_G$ and introduce $n$-regular $AC$-groups. Also we then obtain a formula for Szeged index of $Gamma_G$ in terms of $n$, $|Z(G)|$ and $|G|...
متن کاملPartially Commutative Inverse Monoids
Free partially commutative inverse monoids are investigated. Analogously to free partially commutative monoids (trace monoids), free partially commutative inverse monoids are the quotients of free inverse monoids modulo a partially defined commutation relation on the generators. A quasi linear time algorithm for the word problem is presented, more precisely, we give an O(n log(n)) algorithm for...
متن کاملDivisorial rings and Cox rings
1 Preliminaries on monoids Definition 1.1. An Abelian monoid is a set with a binary, associative, and commutative operation which has a neutral element. It will often be called just a monoid in this manuscript because we will not deal with non-commutative monoids. A monoid M is called • finitely generated if there is a finite set of generators, or equivalently if there is a surjection of monoid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014